Stability and Performances in Biclustering Algorithms
نویسندگان
چکیده
Stability is an important property of machine learning algorithms. Stability in clustering may be related to clustering quality or ensemble diversity, and therefore used in several ways to achieve a deeper understanding or better confidence in bioinformatic data analysis. In the specific field of fuzzy biclustering, stability can be analyzed by porting the definition of existing stability indexes to a fuzzy setting, and then adapting them to the biclustering problem. This paper presents work done in this direction, by selecting some representative stability indexes and experimentally verifying and comparing their properties. Experimental results are presented that indicate both a general agreement and some differences among the selected methods.
منابع مشابه
Improving performances of suboptimal greedy iterative biclustering heuristics via localization
MOTIVATION Biclustering gene expression data is the problem of extracting submatrices of genes and conditions exhibiting significant correlation across both the rows and the columns of a data matrix of expression values. Even the simplest versions of the problem are computationally hard. Most of the proposed solutions therefore employ greedy iterative heuristics that locally optimize a suitably...
متن کاملDNA Microarray Data Analysis: A Novel Biclustering Algorithm Approach
Biclustering algorithms refer to a distinct class of clustering algorithms that perform simultaneous row-column clustering. Biclustering problems arise in DNAmicroarray data analysis, collaborative filtering, market research, information retrieval, text mining, electoral trends, exchange analysis, and so forth. When dealing with DNA microarray experimental data for example, the goal of bicluste...
متن کاملPropagation-Based Biclustering Algorithm for Extracting Inclusion-Maximal Motifs
Biclustering, which is simultaneous clustering of columns and rows in data matrix, became an issue when classical clustering algorithms proved not to be good enough to detect similar expressions of genes under subset of conditions. Biclustering algorithms may be also applied to different datasets, such as medical, economical, social networks etc. In this article we explain the concept beneath h...
متن کاملAAAI Proceedings Template
The small sample sizes and high dimensionality of gene expression datasets pose significant problems for unsupervised subgroup discovery. While the stability of unidimensional clustering algorithms has been previously addressed, generalizing existing approaches to biclustering has proved extremely difficult. Despite these difficulties, developing a stable biclustering algorithm is essential for...
متن کاملApproximating Concept Stability
Concept stability was used in numerous applications for selecting concepts as biclusters of similar objects. However, scalability remains a challenge for computing stability. The best algorithms known so far have algorithmic complexity quadratic in the size of the lattice. In this paper the problem of approximate stability computation is analyzed. An approximate algorithm for computing stabilit...
متن کامل